Equitability and welfare maximization for allocating indivisible items
نویسندگان
چکیده
Abstract We study fair allocations of indivisible goods and chores in conjunction with system efficiency, measured by two social welfare functions, namely utilitarian egalitarian welfare. To model preference, each agent is associated a cardinal additive valuation function. The fairness criteria we are concerned equitability up to any item (EQX) one (EQ1). For the trade-off between investigate efficiency loss under these constraints establish price fairness. From computational perspective, provide complete picture complexity (i) deciding existence an EQX/EQ1 welfare-maximizing allocation; (ii) computing maximizer among all allocations.
منابع مشابه
X Allocating Indivisible Items in Categorized Domains
To overcome the communicational and computational barriers in allocation problems of indivisible items, we propose a novel and general class of allocation problems called categorized domain allocation problems (CDAPs), where the indivisible items are partitioned into multiple categories and we must allocate the items to the agents without monetary transfer, such that each agent gets at least on...
متن کاملAllocating Indivisible Items in Categorized Domains
We initiate a research agenda of mechanism design for categorized domain allocation problems (CDAPs), where indivisible items from multiple categories are allocated to agents without monetary transfer and each agent gets at least one item per category. We focus on basic CDAPs, where each agent gets exactly one item per category. We first characterize serial dictatorships by a minimal set of thr...
متن کاملFairly Allocating Contiguous Blocks of Indivisible Items
In this paper, we study the classic problem of fairly allocating indivisible items with the extra feature that the items lie on a line. Our goal is to find a fair allocation that is contiguous, meaning that the bundle of each agent forms a contiguous block on the line. While allocations satisfying the classical fairness notions of proportionality, envyfreeness, and equitability are not guarante...
متن کاملA Allocating Indivisible Items in Categorized Domains
We formulate a general class of allocation problems called categorized domain allocation problems (CDAPs), where indivisible items from multiple categories are allocated to agents without monetary transfer and each agent gets at least one item per category. We focus on basic CDAPs, where the number of items in each category is equal to the number of agents. We characterize serial dictatorships ...
متن کاملAPX-Hardness of Maximizing Nash Social Welfare with Indivisible Items
We study the problem of allocating a set of indivisible items to agents with additive utilities to maximize the Nash social welfare. Cole and Gkatzelis [3] recently proved that this problem admits a constant factor approximation. We complement their result by showing that this problem is APX-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2022
ISSN: ['1387-2532', '1573-7454']
DOI: https://doi.org/10.1007/s10458-022-09587-1